Computability in Basic Quantum Mechanics
نویسندگان
چکیده
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space H. In terms of the Hilbert lattice L of closed linear subspaces of L the notions of state and observable can be formulated as kind of measures as in [20]. The aim of this paper is to show that there is a good notion of computability for these data structures in the sense of Weihrauch’s Type Two Effectivity (TTE). Instead of explicitly exhibiting admissible representations for the data types under consideration we show that they do live within the category QCB 0 which is equivalent to the category AdmRep of admissible representations and continuously realizable maps between them. For this purpose in case of observables we have to replace measures by valuations which allows us to come up with an effective version of von Neumann’s Spectral Theorem.
منابع مشابه
The quantum algorithm of Kieu does not solve the Hilbert’s tenth problem
Recently T. Kieu [1] claimed a quantum algorithm computing some functions beyond the Church-Turing class. He notes that “it is in fact widely believed that quantum computation cannot offer anything new about computability” and claims the opposite. However, his quantum algorithm does not work, which is the point of my short note. I still believe that quantum computation leads to new complexity b...
متن کاملQuantum Algorithms for the Hilbert’s Tenth Problem
Computation based on the principles of Quantum Mechanics [1] has been shown to offer better performances over classical computation, ranging from the square-root improvement in an unstructured search [2] to the exponential gain in the factorisation of integers [3]. However superior in reducing the complexity of hard computation, these quantum algorithms and all the others discovered so far are ...
متن کاملA reformulation of Hilbert’s tenth problem through Quantum Mechanics
Inspired by Quantum Mechanics, we reformulate Hilbert’s tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shrödinger propagator with some appropriate kernel. Either way, Mathematics and Physics could be combined for Hilbert’s tenth problem and for the notion of effective computability.
متن کاملQuantum Principles and Mathematical Computability
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then outline a quantum mechanical “algorithm” for one of the insoluble problems of mathematics, the Hilbert’s tenth and equivalently the Turing halting problem. The key...
متن کاملTowards A Theory Of Quantum Computability
We propose a definition of quantum computable functionsas mappings between superpositions of natural numbers to probabilitydistributions of natural numbers. Each function is obtained as a limitof an infinite computation of a quantum Turing machine. The class ofquantum computable functions is recursively enumerable, thus openingthe door to a quantum computability theory which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.09209 شماره
صفحات -
تاریخ انتشار 2016